public class Hash2<K,V> {
    static class Node<K,V>{
        public K key;
        public V val;
        public Node<K,V> next;

        public Node(K key,V val){
            this.key = key;
            this.val = val;
        }
    }
    public Node<K,V> array[];
    public int usedsize;
    public double Usedfactor = 0.75;
    public Hash2(){
        array = (Node<K, V>[])new Node[10];
    }
    public void push(K key, V val){
        int hash = key.hashCode();
        int index = hash % array.length;

        Node<K,V> cur = array[index];
        while (cur != null){
            if (cur.equals(key)){
                cur.val = val;
            }
            cur = cur.next;
        }
        Node<K,V> node = new Node<K,V>(key, val);
        node.next = array[index];
        array[index] = node;
        usedsize++;
    }
    public V get(K key){
        int hash = key.hashCode();
        int index = hash % array.length;
        Node<K,V> cur = array[index];
        while (cur != null){
            if (cur.key.equals(key)){
                return cur.val;
            }
            cur = cur.next;
        }
        return null;

    }
}
